Local Search Methods for Min-Max Clearing Problem
نویسندگان
چکیده
In the ongoing power system reform in Japan, division of transmission and distribution is separated from former general electric utility became a business operator. After reform, operators will procure reserve market. We have formulated clearing problem market as 0-1 integer programming problem. This can be viewed Min-Max set multi-cover Since covering belongs NP-hard, it not easy to solve large-scale problems practical time. this paper, we propose greedy solution local search evaluate its performance by numerical experiments.
منابع مشابه
A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem
The purpose of this article is to present a novel method to approximately solve the Multiple-Scenario Max-Min Knapsack Problem (MSMKP). This problem models many real world situations, e.g. when for many scenarios noted π ∈ P = {1, . . . , P}, the aim is to identify the one offering a better alternative in term of maximizing the worst possible outcome. Herein is presented a cooperative approach ...
متن کاملMax{min Ant System and Local Search for the Traveling Salesman Problem
| Ant System is a general purpose algorithm inspired by the study of the behavior of Ant Colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In this paper we introduce MAX{MIN Ant System, an improved version of basic Ant System, and report our results for its application to symmetric and asymmetric instances of the we...
متن کاملOn the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the art in performance for universal (i.e. non specialized solvers) seems to be variants of Simulated Annealing (SA) and MaxWalkSat (MWS), stochastic local search methods. Local search methods are conceptually simple, and ...
متن کاملThe Min-max Edge q-Coloring Problem
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a colo...
متن کاملOn the max min vertex cover Problem
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Shisutemu Seigyo Jo?ho? Gakkai ronbunshi
سال: 2022
ISSN: ['1342-5668', '2185-811X']
DOI: https://doi.org/10.5687/iscie.35.193